Minimal Vertex Unique Labelled Subgraph Mining
نویسندگان
چکیده
This paper introduces the concept of Vertex Unique Labelled Subgraph Mining (VULSM), a specialised form of subgraph mining. A VULS is a subgraph defined by a set of edge labels that has a unique vertex labelling associated with it. A minimal VULS is then a VULS which is not a supergraph of any other VULS. The application considered in this paper, for evaluation purposes, is error prediction with respect to sheet metal forming. The minimum BFS Right-most Extension Unique Subgraph Mining (Min-BFS-REUSM) algorithm is introduced for identifying minimal VULS using a Breadth First Search(BFS) strategy.
منابع مشابه
Vertex unique labelled subgraph mining
With the successful development of efficient algorithms for Frequent Subgraph Mining (FSM), this paper extends the scope of subgraph mining by proposing Vertex Unique labelled Subgraph Mining (VULSM). VULSM has a focus on the local properties of a graph and does not require external parameters such as the support threshold used in frequent pattern mining. There are many applications where the m...
متن کاملA Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of is even; (ii) that the number of the closed patterns is precisely double the number of maximal complete bipartite subgraphs of ; (iii) that for every maximal complete bipartite subgraph, there always exists a unique and distinct pair of closed patterns that matches the two vert...
متن کاملThe binding number of a random graph
Let G be a random graph with n labelled vertices in which the edges are chosen independently with a fixed probability p, 0 < p < 1. In this note we prove that, with the probability tending to 1 as n -+ 00, the binding number of a random graph G satisfies: (i) b(G) = (n l)/(n 8), where 8 is the minimal degree of G; (ii) l/q E < b(G) < l/q, where E is any fixed positive number and q = 1 p; (iii) ...
متن کاملFrequent subgraph mining algorithms on weighted graphs
This thesis describes research work undertaken in the field of graph-based knowledge discovery (or graph mining). The objective of the research is to investigate the benefits that the concept of weighted frequent subgraph mining can offer in the context of the graph model based classification. Weighted subgraphs are graphs where some of the vertexes/edges are considered to be more significant t...
متن کاملConnected Tropical Subgraphs in Vertex-Colored Graphs
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the graph. In this work we study the problem of finding a minimal connected tropical subgraph. We first show that this problem is NP-Hard for trees, interval graphs and split graphs, but polynomial when the number of colors is logarithmic in terms of the order of the graph (i.e. FPT). We then provide ...
متن کامل